#include <vector>
#include <set>
#include <iostream>
#include <unordered_map>
using namespace std;

int mymaxCount(int m, int n, vector<vector<int>>& ops) {
    if(ops.size() == 0){
        return m * n;
    }
    vector<vector<int>> temp(m, vector<int> (n, 0));
    for(int z = 0; z < ops.size(); z++){
        for(int i = 0; i < ops[z][0]; i++){
            for(int j = 0; j < ops[z][1]; j++){
                temp[i][j]++;
            }
        }
    }
    int maxm = temp[0][0], maxn = temp[0][0];
    for(int i = 1; i < m; i++){
        if(temp[i][0] < maxm){
            maxm = i;
            break;
        }
    }
    for(int i = 1; i < n; i++){
        if(temp[0][i] < maxn){
            maxn = i;
            break;
        }
    }
    return maxm * maxn;
}

int maxCount(int m, int n, vector<vector<int>>& ops) {
    int mina = m, minb = n;
    for (const auto& op: ops) {
        mina = min(mina, op[0]);
        minb = min(minb, op[1]);
    }
    return mina * minb;
}

int main(){
    vector<vector<int>> img = { {100,200,100},{200,50,200},{100,200,100} };
    
    return 0;
}